Implementation of Multi-continued Fraction Algorithm and Application to Multi-sequence Linear SynthesisQUANLONG WANG; KUNPENG WANG; ZONGDUO DAI et al.Lecture notes in computer science. 2006, pp 248-258, issn 0302-9743, isbn 3-540-44523-4, 1Vol, 11 p.Conference Paper

Long-step homogeneous interior-point algorithm for the P_* -nonlinear complementarity problemsLESAJA, Goran.Yugoslav journal of operations research. 2002, Vol 12, Num 1, pp 17-48, issn 0354-0243, 32 p.Article

Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SATDENMAN, Richard; FOSTER, Stephen.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1655-1659, issn 0166-218X, 5 p.Article

Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithmsSALAHI, Maziar; TERLAKY, Tamas.European journal of operational research. 2007, Vol 182, Num 2, pp 502-513, issn 0377-2217, 12 p.Article

First- and second-order methods for semidefinite programmingMONTEIRO, Renato D. C.Mathematical programming. 2003, Vol 97, Num 1-2, pp 209-244, issn 0025-5610, 36 p.Article

AN ADAPTIVE LONG STEP INTERIOR POINT ALGORITHM FOR LINEAR OPTIMIZATIONSALAHI, Maziar.Kybernetika. 2010, Vol 46, Num 4, pp 722-729, issn 0023-5954, 8 p.Article

On computational complexity of siegel julia setsBINDER, I; BRAVERMAN, M; YAMPOLSKY, M et al.Communications in mathematical physics. 2006, Vol 264, Num 2, pp 317-334, issn 0010-3616, 18 p.Article

On the P-NP problem over real matrix ringsRYBALOV, A.Theoretical computer science. 2004, Vol 314, Num 1-2, pp 281-285, issn 0304-3975, 5 p.Article

The Intensional Content of Rice's Theorem (Pearl)ASPERTI, Andrea.ACM SIGPLAN notices. 2008, Vol 43, Num 1, pp 113-119, issn 1523-2867, 7 p.Conference Paper

Incremental approach to computation of elementary siphons for arbitrary simple sequential processes with resourcesCHAO, D. Y.IET control theory & applications (Print). 2008, Vol 2, Num 2, pp 168-179, issn 1751-8644, 12 p.Article

New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd directionPENG, J; ROOS, C; TERLAKY, T et al.Journal of optimization theory and applications. 2001, Vol 109, Num 2, pp 327-343, issn 0022-3239Article

Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour ClassesRIZZI, Romeo; CARIOLARO, David.Algorithmica. 2014, Vol 69, Num 3, pp 494-500, issn 0178-4617, 7 p.Article

Linear Complexity of a New Generalized Cyclotomic Sequence of Order Two of Length pqXIAOPING LI; WENPING MA; TONGJIANG YAN et al.IEICE transactions on fundamentals of electronics, communications and computer science. 2013, Vol 96, Num 5, pp 1001-1005, issn 0916-8508, 5 p.Article

New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problemsTAMIR, Arie.Operations research letters. 2009, Vol 37, Num 5, pp 303-306, issn 0167-6377, 4 p.Article

The use of edge-directions and linear programming to enumerate verticesONN, Shmuel; ROTHBLUM, Uriel G.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, pp 153-164, issn 1382-6905, 12 p.Conference Paper

Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel functionAMINI, K; PEYGHAMI, M. R.Applied mathematics and computation. 2006, Vol 176, Num 1, pp 194-207, issn 0096-3003, 14 p.Article

New complexity analysis of IIPMs for linear optimization based on a specific self-regular functionSALAHI, M; PEYGHAMI, M. R; TERLAKY, T et al.European journal of operational research. 2008, Vol 186, Num 2, pp 466-485, issn 0377-2217, 20 p.Article

Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimizationSALAHI, M; TERLAKY, T.Journal of optimization theory and applications. 2007, Vol 132, Num 1, pp 143-160, issn 0022-3239, 18 p.Article

FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SDO PROBLEMSMANSOURI, Hossein.Kybernetika. 2012, Vol 48, Num 5, pp 907-923, issn 0023-5954, 17 p.Article

On the Complexity of Time-Dependent Shortest PathsFOSCHINI, Luca; HERSHBERGER, John; SURI, Subhash et al.Algorithmica. 2014, Vol 68, Num 4, pp 1075-1097, issn 0178-4617, 23 p.Article

Delay minimization by exploring full-duplex capacity and relay-based cooperative scheduling in WLANs : Quality of Service in Wireless and Mobile NetworkingTAO HUANG; BAOLIU YE; SONG GUO et al.Journal of network and computer applications. 2014, Vol 46, pp 407-417, issn 1084-8045, 11 p.Article

Generalized Chat Noir is PSPACE-Complete : New Trends in Algorithms and Theory of ComputationIWAMOTO, Chuzo; MUKAI, Yuta; SUMIDA, Yuichi et al.IEICE transactions on information and systems. 2013, Vol 96, Num 3, pp 502-505, issn 0916-8532, 4 p.Article

Resource Allocation for SVC Multicast over Wireless Relay Networks: RS Specification Function Based Simplification and Heuristics : Smart Multimedia & Communication SystemsZHOU, Hao; JI, Yusheng; ZHAO, Baohua et al.IEICE transactions on fundamentals of electronics, communications and computer science. 2013, Vol 96, Num 11, pp 2089-2098, issn 0916-8508, 10 p.Conference Paper

Decentralized Prognosis of Failures in Discrete Event SystemsKUMAR, Ratnesh; TAKAI, Shigemasa.IEEE transactions on automatic control. 2010, Vol 55, Num 1, pp 48-59, issn 0018-9286, 12 p.Article

Context-aware end-to-end QoS qualitative diagnosis and quantitative guarantee based on Bayesian networkXIANGTAO LIN; BO CHENG; JUNLIANG CHEN et al.Computer communications. 2010, Vol 33, Num 17, pp 2132-2144, issn 0140-3664, 13 p.Article